Measuring performance of ad hoc networks using timescales for information flow

We define metrics to characterize the performance of ad hoc networks based on timescales for information flow, power consumption and interference. The statistical distribution of timescales has not been previously considered. Yet, it is important for understanding the feasibility of communicating over such networks, for comparing different algorithms for building up network topology and for distinguishing regimes of routing. We quantify the longest timescale for information flow and estimate its distribution. We also introduce a decentralized adaptive power algorithm, that uses only information local to each device, for building ad hoc networks. This algorithm is shown to perform significantly better by all our metrics when compared with a standard, constant power, algorithm.